From Hybrid Modal Logic to Matching Logic and Back
نویسندگان
چکیده
منابع مشابه
Axiomatizing hybrid logic using modal logic
We study hybrid logics with nominals and ‘actuality’ operators @i. We recall the method of ten Cate, Marx, and Viana to simulate hybrid logic using modalities and ‘nice’ frames, and we show that the hybrid logic of a class of frames is the modal logic of the class of its corresponding nice frames. Using these results, we show how to axiomatize the hybrid logic of any elementary class of frames....
متن کاملBack and Forth Between Modal Logic and Classical Logic
Modal Logic is traditionally concerned with the intensional operators \possibly" and \necessary", whose intuitive correspondence with the standard quantiiers \there ex-ists" and \for all" comes out clearly in the usual Kripke semantics. This observation underlies the well-known translation from modal logic into the rst-order language over possible worlds models 12, 13]. In this way, modal forma...
متن کاملFrom Hoare Logic to Matching Logic Reachability
Matching logic reachability has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic reachability provides a language-independent and sound proof system that directly uses the trusted operational semantics of the language as axioms....
متن کاملFrom Hoare Logic to Matching Logic
Matching logic has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic provides a language-independent and sound proof system that directly uses the trusted operational semantics of the language as axioms. Matching logic thus has a...
متن کاملResolution in Modal, Description and Hybrid Logic
We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and works directly on modal, description or hybrid logic formulas instead. In addition, by using the hybrid machinery it avoids the complexities of earlier propositional resolution-based methods for mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.303.2